On hamiltonicity of uniform random intersection graphs
نویسندگان
چکیده
منابع مشابه
On the independence number and Hamiltonicity of uniform random intersection graphs
In the uniform random intersection graphs model, denoted by G n,m,λ , to each vertex v we assign exactly λ randomly chosen labels of some label set M of m labels and we connect every pair of vertices that has at least one label in common. In this model, we estimate the independence number α(G n,m,λ), for the wide, interesting range m = n α , α < 1 and λ = O(m 1/4). We also prove the hamiltonici...
متن کاملEpidemics on random intersection graphs
In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of cliques, each of random size, and infection can be transmitted between two individuals if and only if there is a clique they both belong to. Both the clique sizes and th...
متن کاملRobust Hamiltonicity of random directed graphs
In his seminal paper from 1952 Dirac showed that the complete graph on n ≥ 3 vertices remains Hamiltonian even if we allow an adversary to remove bn/2c edges touching each vertex. In 1960 Ghouila-Houri obtained an analogue statement for digraphs by showing that every directed graph on n ≥ 3 vertices with minimum inand out-degree at least n/2 contains a directed Hamilton cycle. Both statements q...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملLong paths and Hamiltonicity in random graphs
We discuss several classical results about long paths and Hamilton cycles in random graphs and present accessible versions of their proofs, relying on the Depth First Search (DFS) algorithm and the notion of boosters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2010
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.2010.80